Curves of constant diameter and inscribed polygons
نویسنده
چکیده
If one drops the unicity assumption, (C(D)) is the property of having constant diameter, which is in fact equivalent (for closed curves in the plane) to having constant width or constant breadth (for the definitions and the proof of the equivalence, see [8, chap. 25]). It is a surprise to many (including me !) that curves of constant diameter other that the circle do exist. The simplest examples (due to Reuleaux [9]) are pictured below. They are built with circle arcs whose centers are marked with a black dot. Notice that these curves are not C2.
منابع مشابه
Algorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کامل2 1 A ug 2 00 7 The geometry of Minkowski spaces — a survey . Part I Horst Martini
We survey elementary results in Minkowski spaces (i.e. finite dimensional Banach spaces) that deserve to be collected together, and give simple proofs for some of them. We place special emphasis on planar results. Many of these results have often been rediscovered as lemmas to other results. In Part I we cover the following topics: The triangle inequality and consequences such as the monotonici...
متن کاملOn configuration spaces of plane polygons, sub-Riemannian geometry and periodic orbits of outer billiards
The classical billiard system describes the motion of a point in a plane domain subject to the elastic reflection off the boundary, described by the familiar law of geometrical optics: the angle of incidence equals the angle of reflection; see, e.g., [13, 14] for surveys of mathematical billiards. For every n ≥ 2, the billiard system inside a circle has a very special property: every point of t...
متن کاملLargest inscribed rectangles in convex polygons
We consider approximation algorithms for the problem of computing an inscribed rectangle having largest area in a convex polygon on n vertices. If the order of the vertices of the polygon is given, we present a randomized algorithm that computes an inscribed rectangle with area at least (1− ) times the optimum with probability t in time O( 1 log n) for any constant t < 1. We further give a dete...
متن کاملAsymmetric polygons with maximum area
We say that a polygon inscribed in the circle is asymmetric if it contains no two antipodal points being the endpoints of a diameter. Given n diameters of a circle and a positive integer k < n, this paper addresses the problem of computing a maximum area asymmetric k-gon having as vertices k < n endpoints of the given diameters. The study of this type of polygons is motivated by ethnomusiciolog...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005